YES 0.451 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/Monad.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:



HASKELL
  ↳ LR

mainModule Monad
  ((liftM2 :: (c  ->  a  ->  b ->  IO c  ->  IO a  ->  IO b) :: (c  ->  a  ->  b ->  IO c  ->  IO a  ->  IO b)

module Monad where
  import qualified Maybe
import qualified Prelude

  liftM2 :: Monad b => (c  ->  d  ->  a ->  b c  ->  b d  ->  b a
liftM2 f m1 m2 m1 >>= (\x1 ->m2 >>= (\x2 ->return (f x1 x2)))


module Maybe where
  import qualified Monad
import qualified Prelude



Lambda Reductions:
The following Lambda expression
\x2return (f x1 x2)

is transformed to
liftM20 f x1 x2 = return (f x1 x2)

The following Lambda expression
\x1m2 >>= liftM20 f x1

is transformed to
liftM21 m2 f x1 = m2 >>= liftM20 f x1



↳ HASKELL
  ↳ LR
HASKELL
      ↳ BR

mainModule Monad
  ((liftM2 :: (b  ->  c  ->  a ->  IO b  ->  IO c  ->  IO a) :: (b  ->  c  ->  a ->  IO b  ->  IO c  ->  IO a)

module Maybe where
  import qualified Monad
import qualified Prelude


module Monad where
  import qualified Maybe
import qualified Prelude

  liftM2 :: Monad c => (b  ->  a  ->  d ->  c b  ->  c a  ->  c d
liftM2 f m1 m2 m1 >>= liftM21 m2 f

  
liftM20 f x1 x2 return (f x1 x2)

  
liftM21 m2 f x1 m2 >>= liftM20 f x1



Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ LR
    ↳ HASKELL
      ↳ BR
HASKELL
          ↳ COR

mainModule Monad
  ((liftM2 :: (a  ->  b  ->  c ->  IO a  ->  IO b  ->  IO c) :: (a  ->  b  ->  c ->  IO a  ->  IO b  ->  IO c)

module Monad where
  import qualified Maybe
import qualified Prelude

  liftM2 :: Monad b => (a  ->  c  ->  d ->  b a  ->  b c  ->  b d
liftM2 f m1 m2 m1 >>= liftM21 m2 f

  
liftM20 f x1 x2 return (f x1 x2)

  
liftM21 m2 f x1 m2 >>= liftM20 f x1


module Maybe where
  import qualified Monad
import qualified Prelude



Cond Reductions:
The following Function with conditions
undefined 
 | False
 = undefined

is transformed to
undefined  = undefined1

undefined0 True = undefined

undefined1  = undefined0 False



↳ HASKELL
  ↳ LR
    ↳ HASKELL
      ↳ BR
        ↳ HASKELL
          ↳ COR
HASKELL
              ↳ Narrow

mainModule Monad
  (liftM2 :: (c  ->  a  ->  b ->  IO c  ->  IO a  ->  IO b)

module Maybe where
  import qualified Monad
import qualified Prelude


module Monad where
  import qualified Maybe
import qualified Prelude

  liftM2 :: Monad b => (a  ->  c  ->  d ->  b a  ->  b c  ->  b d
liftM2 f m1 m2 m1 >>= liftM21 m2 f

  
liftM20 f x1 x2 return (f x1 x2)

  
liftM21 m2 f x1 m2 >>= liftM20 f x1



Haskell To QDPs